Applications of the Wold Decomposition to the Study of Row Contractions Associated with Directed Graphs

نویسنده

  • ELIAS KATSOULIS
چکیده

Based on a Wold decomposition for families of partial isometries and projections of Cuntz-Krieger-Toeplitz-type, we extend several fundamental theorems from the case of single vertex graphs to the general case of countable directed graphs with no sinks. We prove a Szego-type factorization theorem for CKT families, which leads to information on the structure of the unit ball in free semigroupoid algebras, and show that joint similarity implies joint unitary equivalence for such families. For each graph we prove a generalization of von Neumann’s inequality which applies to row contractions of operators on Hilbert space which are related to the graph in a natural way. This yields a functional calculus determined by quiver algebras and free semigroupoid algebras. We establish a generalization of Coburn’s theorem for the C∗-algebra of a CKT family, and prove a universality theorem for C∗-algebras generated by these families. In both cases, the C∗-algebras generated by quiver algebras play the universal role.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partially Isometric Dilations of Noncommuting N-tuples of Operators

Given a row contraction of operators on Hilbert space and a family of projections on the space which stabilize the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries which satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in ...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

Fixed points for Chatterjea contractions on a metric space with a graph

In this work‎, ‎we formulate Chatterjea contractions using graphs in metric spaces endowed with a graph ‎‎and‏ ‎‎‎‎investigate ‎the ‎existence‎ ‎of ‎fixed ‎points ‎for such mappings ‎under two different hypotheses‎. We also discuss the uniqueness of the fixed point. The given result is a generalization of Chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a graph.

متن کامل

Blind Separation of Jointly Stationary Correlated Sources

The separation of unobserved sources from mixed observed data is a fundamental signal processing problem. Most of the proposed techniques for solving this problem rely on independence or at least uncorrelation assumption for source signals. This paper introduces a technique for cases that source signals are correlated with each other. The method uses Wold decomposition principle for extracting ...

متن کامل

Cayley graph associated to a semihypergroup

The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first  we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as  Hamiltonian cycles in this  graph.  Also, by some of examples we will illustrate  the properties and behavior of  these Cayley  graphs, in particulars we show that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004